Developing Certiied Programs in the System Coq the Program Tactic Developing Certiied Programs in the System Coq the Program Tactic
نویسنده
چکیده
The system Coq is an environment for proof development based on the Calculus of Constructions extended by inductive deenitions. Functional programs can be extracted from constructive proofs written in Coq. The extracted program and its corresponding proof are strongly related. The idea in this paper is to use this link to have another approach: to give a program and to generate automatically the proof from which it could be extracted. Moreover, we introduce a notion of annotated programs. R esum e Le syst eme Coq est un environnement de d eveloppement de preuves bas e sur le Calcul des Constructions enrichi par des d eenitions inductives. Des programmes fonctionnels peuvent ^ etre extraits des preuves constructives ecrites en Coq. Le programme extrait et sa preuve sont fortement reli es. L'id ee dans ce papier est d'utiliser ce lien pour une approche dii erente : donner un programme et g en erer automatiquement la preuve dont il aurait pu ^ etre extrait. De plus, une notion de programmes annot es est introduite.
منابع مشابه
A Reflection-based Proof Tactic for Lattices in Coq
Coq is a proof assistant featuring a tactic-based interactive theorem prover. The latest incarnation comes with over 150 tactics that assist the user in developing a formal proof. These tactics range from the simple and mundane to the ‘allpowerful’. Some examples from the latter category are the omega tactic that solves a goal in Presburger arithmetic and the ring and field tactics that solve i...
متن کاملCoq in Coq
We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.
متن کاملCoq in
We formalize the deenition and the metatheory of the Calculus of Constructions (CC) using the proof assistant Coq. In particular, we prove strong nor-malization and decidability of type inference. From the latter proof, we extract a certiied Objective Caml program which performs type inference in CC and use this code to build a small-scale certiied proof-checker.
متن کاملDeveloping Certified Programs in the System Coq - The Program Tactic
The system Coq is an environment for proof development based on the Calculus of Constructions extended by inductive deenitions. The speciication of a program can be represented by a logical formula and the program itself can be extracted from the constructive proof of the speciication. In this paper, we look at the possibility of inverting the extraction process. More precisely, we present a me...
متن کاملInteractive typed tactic programming in the Coq proof assistant
Interactive Typed Tactic Programming in the Coq Proof Assistant Beta Ziliani 2015 In order to allow for the verification of realistic problems, Coq provides a language for tactic programming, therefore enabling general-purpose scripting of automation routines. However, this language is untyped, and as a result, tactics are known to be difficult to compose, debug, and maintain. In this thesis, I...
متن کامل